Children crying at birthday parties. Why? Fairness and incentives for cake division problems
نویسنده
چکیده
We consider the problem of dividing a non-homogeneous onedimensional continuum whose endpoints are identified. Examples are the division of a birthday cake, the partition of a circular market, the assignment of sentry duty or medical call. We study the existence of rules satisfying various requirements of fairness (no-envy, egalitarianequivalence; and several requirements having to do with changes in the data of the problem), and that induce agents to reveal their preferences honestly (strategy-proofness). JEL classification numbers: D63, D70 Key-words: cake division, no-envy, strategy-proofness.
منابع مشابه
How to Re-Divide a Cake Fairly
We study the classic problem of fairly dividing a heterogeneous resource (”cake”) among several agents with different preferences. In our setting, the resource is already divided among several ”old” agents. When ”young” agents come, the resource should be re-divided in a way that is fair both for the young and for the old agents. Motivated by land redivision and other two-dimensional division p...
متن کاملFair division - from cake-cutting to dispute resolution
Fair Division, unlike most research on fairness in the social sciences and mathematics, is devoted solely to the analysis of constructive procedures for actually dividing things up and resolving disputes, including...
متن کاملN-person Envy-free Chore Division
In this paper we consider the problem of chore division, which is closely related to a classical question, due to Steinhaus [7], of how to cut a cake fairly. We focus on constructive solutions, i.e., those obtained via a well-defined procedure or algorithm. Among the many notions of fairness is envy-freeness: an envy-free cake division is a set of cuts and an allocation of the pieces that gives...
متن کاملOnline Cake Cutting (published version)
We propose an online form of the cake cutting problem. This models situations where agents arrive and depart during the process of dividing a resource. We show that well known fair division procedures like cut-and-choose and the Dubins-Spanier moving knife procedure can be adapted to apply to such online problems. We propose some fairness properties that online cake cutting procedures can posse...
متن کاملThrow One's Cake --- and Have It Too
We consider the problem of fairly dividing a heterogeneous cake between a number of players with different tastes. In this setting, it is known that fairness requirements may result in a suboptimal division from the social welfare standpoint. Here, we show that in some cases, discarding some of the cake and fairly dividing only the remainder may be socially preferable to any fair division of th...
متن کامل